Blocking sets in PG ( 2 , q n ) from cones of PG ( 2 n , q )

نویسندگان

  • Francesco Mazzocca
  • Olga Polverino
چکیده

Let and B̄ be a subset of = PG(2n − 1, q) and a subset of PG(2n, q) respectively, with ⊂ PG(2n, q) and B̄ ⊂ . Denote by K the cone of vertex and base B̄ and consider the point set B defined by B = (K\ ) ∪ {X ∈ S : X ∩ K = ∅}, in the André, Bruck-Bose representation of PG(2, qn) in PG(2n, q) associated to a regular spread S of PG(2n − 1, q). We are interested in finding conditions on B̄ and in order to force the set B to be a minimal blocking set in PG(2, qn). Our interest is motivated by the following observation. Assume a Property α of the pair ( , B̄) forces B to turn out a minimal blocking set. Then one can try to find new classes of minimal blocking sets working with the list of all known pairs ( , B̄) with Property α. With this in mind, we deal with the problem in the case is a subspace of PG(2n − 1, q) and B̄ a blocking set in a subspace of PG(2n, q); both in a mutually suitable position. We achieve, in this way, new classes and new sizes of minimal blocking sets in PG(2, qn), generalizing the main constructions of [14]. For example, for q = 3h, we get large blocking sets of size qn+2 + 1 (n ≥ 5) and of size greater than qn+2 + qn−6 (n ≥ 6). As an application, a characterization of Buekenhout-Metz unitals in PG(2, q2k) is also given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q)

In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k′-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei ty...

متن کامل

The use of blocking sets in Galois geometries and in related research areas

Blocking sets play a central role in Galois geometries. Besides their intrinsic geometrical importance, the importance of blocking sets also arises from the use of blocking sets for the solution of many other geometrical problems, and problems in related research areas. This article focusses on these applications to motivate researchers to investigate blocking sets, and to motivate researchers ...

متن کامل

Groups With Maximal Irredundant Covers And Minimal Blocking Sets

Let n be a positive integer. Denote by PG(n, q) the n-dimensional projective space over the finite field Fq of order q. A blocking set in PG(n, q) is a set of points that has non-empty intersection with every hyperplane of PG(n, q). A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if PG(ni, q) contains a minimal blocking set of size ki...

متن کامل

On the Linearity of Higher-Dimensional Blocking Sets

A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n − k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies this property. The linearity conjecture states that all small minimal k-blocking sets in PG(n, q) are linear over a subfield Fpe of Fq. Apart from a few cases,...

متن کامل

New Large (n, r)-arcs in PG(2, q)

An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in  $PG(2, q)$ is denoted by $m_r(2,q)$.  In this paper we present  a new $(184,12)$-arc in PG$(2,17),$  a new $(244,14)$-arc and a new $(267,15$)-arc in $PG(2,19).$

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006